A bottom-up algorithm for query decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bottom-up Algorithm for Query Decomposition

In order to access data from various different data repositories, in Global-As-View approaches an input query is decomposed into several subqueries. Normally, this decomposition is based on a set of mappings, which describe the correspondence of data elements between a global schema and local ones. However, building mappings is a difficult task, especially when the number of participating local...

متن کامل

Generalized Bottom-Up Query Evaluation

Our goal is to generalize the well known bottom-up, set-oriented query evaluation for deductive databases in two aspects: First, we consider arbitrary clauses as rules in the database, not only Horn clauses or clauses with stratified negation. This allows to represent disjunctive information, in the database as well as in answers to queries. We utilize NF2 relations for modelling sets of disjun...

متن کامل

Semantic Query Optimization for Bottom-Up Evaluation

Semantic query optimization uses semantic knowledge in databases (represented in the form of integrity constraints) to rewrite queries and logic programs to achieve eecient query evaluation. Much work has been done to develop various techniques for optimization. Most of it, however, is applicable to top-down query evaluation strategies. Moreover, little attention has been paid to the cost of th...

متن کامل

A Bottom-Up Algorithm for t-Tautologies

Fuzzy logics based on residuated t-norms provide a robust mathematical formalism for logical deduction under uncertain or vague premises. In this paper, we describe a decision algorithm for the tautology problem of Basic Logic, which is the logic of continuous t-norms and their residua [Háj98, CEGT00]. Our algorithm is a refinement of the semantic method of Baaz, Hájek, Montagna, and Veith [BHM...

متن کامل

Transforming XPath Queries for Bottom-Up Query Processing

The widespreading of XML as a content-description language on the Web requires advanced processing and management techniques for huge XML databases. XPath is a standard language for extracting the specified elements from XML documents, and its efficient support is one of the key issues in the current XML database technology. In this paper, we propose an XPath query transformation method for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Innovative Computing and Applications

سال: 2008

ISSN: 1751-648X,1751-6498

DOI: 10.1504/ijica.2008.019686